#include <iostream>
#include <cstdio>
#include <algorithm>
typedef long long ll;
using namespace std;
ll a[1005];
struct node {
    ll val;
    int x,y;
    bool operator<(const node &b) {
        return this->val<b.val;
    }
};
node b[554510];
int main() {
    int n;
    cin>>n;
    for (int i=0; i<n; i++) scanf("%lld", &a[i]);
    int len=0;
    for (int i=0; i<n; i++) {
        for (int j=i+1; j<n; j++) {
            b[len].val=a[i] + a[j];
            b[len].x=i;
            b[len].y=j;
            len++;
        }
    }
    sort(b,b+len);
    //for (int i=0; i<len; i++) cout<<b[i].val<<' ';
    //cout<<endl;
    int l=0,r=len-1;
    bool flag=false;
    while (l<=r) {
        if (b[l].val+b[r].val==0 && b[l].x!=b[r].x && b[l].x!=b[r].y && b[l].y!=b[r].x && b[l].y!=b[r].y) {
            flag=true;
            break;
        }
        if (abs(b[l].val)>b[r].val) l++;
        else r--;
    }
    if (flag) cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
    return 0;
}
